import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {



    //城市群数量
    int n;
    boolean[] vis = new boolean[210];
    public int citys (ArrayList<ArrayList<Integer>> m) {
        // write code here
        n = m.size();
        int ret = 0;
        for (int i = 0; i < n; i++) {
            if(vis[i] == false){
                ret++;
                dfs(m,i);
            }
        }
        return ret;
    }
    public void dfs(ArrayList<ArrayList<Integer>> m ,int pos){
        vis[pos] = true;
        for (int i = 0; i < n; i++) {
            if(m.get(pos).get(i) == 1 && vis[i] == false){
                dfs(m,i);
            }
        }
    }















    //字符串分类
    public static void main2(String[] args) {
        Scanner in = new Scanner(System.in);
        int n= in.nextInt();
        TreeSet<String> set = new TreeSet<>();

        while (n-- != 0){
            char[] s = in.next().toCharArray();
            Arrays.sort(s);
            set.add(new String(s));
        }
        System.out.println(set.size());
    }


















    //打怪
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        while(t-- != 0){
            int h = in.nextInt();
            int a = in.nextInt();
            int H = in.nextInt();
            int A = in.nextInt();

            if(a>=H) System.out.println(-1);
            else{
                int m = H/a + (H%a != 0 ? 1 : 0);
                int n = m-1;
                int x = n*A;
                int ret = h/x - (h%x == 0 ? 1 : 0);
                System.out.println(ret);
            }
        }
    }











}
